Timed Automata: Semantics, Algorithms and Tools

This report is to provide a tutorial and pointers to results and related work on timed automata with a focus on semantical and algorithmic aspects of verification tools. We present the concrete and abstract semantics of timed automata (based on transition rules, regions and zones), decision problems, and algorithms for verification. A detailed description on DBM (Difference Bound Matrices) is included, which is the central data structure behind several verification tools for timed systems. As an example, we give a brief introduction to the tool UPPAAL. Wang Yi is a professor at the Division of Computer Systems, Department of Information Technology, Uppsala University, Box 337, 751 05 Uppsala, Sweden. He visited UNU-IIST for two months in 2003 working on this report. Email: [email protected]. Johan Bengtsson is at Uppsala University Copyright c © 2004 by UNU-IIST, Johan Bengtsson and Wang Yi